Deductive chart parsing in Haskell
نویسنده
چکیده
Markham, D. 1999. 'Listeners and disguised voices: tiie imitation and perception of dialectal accent'. Forensic Linguistics 6,289-299. McGehee, F. 1937. 'Tiie reliability of the identification of the human voice' Journal of General Psychology 17, 249-271. Reich, A. & J. Duke. 1979. 'Effects of selected voice disguises upon speaker identification by listening'. Journal of the Acoustical Society of America 66,1023-1028. Rodman, R. & M . Powell. 2000. 'Computer recognition of speakers who disguise their voice'. The International conference on signal processing applications and technology ICSPAT2000. http://www.csc.ncsu.edu/ faculty/rodmanyComputer%20Recognition%20of%20Speakers%20Who% 20Disguise%20Their%20Voice.pdf (accessed 19 April 2008). Rose, P. & S. Duncan. 1995. 'Naive auditory identification and discrimination of similar voices by familiar listeners'. Forensic Linguistics 2,1-17. Schiller, N.O. & O. Koster. 1998. 'The ability of expert witnesses to identify voices: a comparison between trained and untrained listeners'. Forensic Linguistics 5, 1-9. Sjostrom, M . 2005. 'Earwitness identification: can a switch of dialect fool us?'. Masters paper, Dept of Philosophy and Linguistics, Umea university. Thompson, C P . 1987. 'A language effect in voice identification'. Applied Cognitive Psychology 1:2,121-131. Van Lancker, D., J. Kreiman & K.T.D. Wickens. 1985. 'Familiar voice recognition: patterns and parameters. Part 2: Recognition of rate-altered voices' Journal of Phonetics 13, 39-52. Yarmey, A.D. 1995. 'Earwitness speaker identification' Psychology, Public Policy, and Law 1,792-816. Yarmey, A.D., A.L. Yarmey, M.J. Yarmey & L. Parliament. 2001. 'Commonsense beliefs and the identification of familiar voices'. Applied Cognitive Psychology 15, 283-299. Zetterholm, E. 2003. Voice imitation: a phonetic study of perceptual illusions and acoustic success. Lund: Dept. of Linguistics and Phonetics, Lund University. Zetterholm, E. 2006. 'Same speaker different voices: a study of one impersonator and some of his different imitations'. Proceedings SST2006, 70-75. Auckland, New Zealand. Lund University, Dept. of Linguistics and Plionetics Working Papers 53 (2008), 159-177 159
منابع مشابه
Chart Parsing and Constraint Programming
In this paper, parsing-as-deduction and constraint programming are brought together to outline a procedure for the specification of constraint-based chart parsers. Following the proposal in Shieber et al. (1995), we show how to directly realize the inference rules for deductive parsers as Constraint Handling Rules (Frühwirth, 1998) by viewing the items of a chart parser as constraints and the c...
متن کاملChart Parsing Multimodal Grammars
The short note describes the chart parser for multimodal type-logical grammars which has been developed in conjunction with the type-logical treebank for French. The chart parser presents an incomplete but fast implementation of proof search for multimodal type-logical grammars using the"deductive parsing"framework. Proofs found can be transformed to natural deduction proofs.
متن کاملExtensible Syntax
Domain-specific embedded languages (DSELs) leverage underlying general-purpose languages to provide high productivity for programmers in many domains, such as computer systems, linear algebra, physics, and other sciences. Writing DSELs in the current generation of general-purpose languages requires a host of tricks, for example, using templates in C++, macros in Scheme, and type classes in Hask...
متن کاملAn Earley Parsing Algorithm for Range Concatenation Grammars
We present a CYK and an Earley-style algorithm for parsing Range Concatenation Grammar (RCG), using the deductive parsing framework. The characteristic property of the Earley parser is that we use a technique of range boundary constraint propagation to compute the yields of non-terminals as late as possible. Experiments show that, compared to previous approaches, the constraint propagation help...
متن کاملSynthesis of Concurrent Haskell programs from Message Sequence Charts
In this article we show how to generate executable Concurrent Haskell programs from message sequence charts (MSCs). MSCs capture the communication between processes in a concurrent system and allow for a concise graphical and textual specification. Their modularity and extensibility can be reflected by Haskell’s module concept. By compiling the generated code, several of the static properties o...
متن کامل